The weak entity set B with descriptive attributes b1, b2, ..., bn, having {b1} as its discriminator and having strong entity set A as the dominant entity set, is always converted into a relation of the same name B with n distinct attributes, each of which corresponds to an attribute of the weak entity set, plus the attributes, that form the primary key of A. The primary key of the derived relation will be formed by the discriminator of B and the primary key of A, say {a1}, and will be indicated accordingly. Moreover, the attributes that refer to relation A will have to be indicated as foreign keys, as they refer to a “foreign” relation. The schema definition would look as follows
B = ( b1(PK), a1(PK)(FK), ..., bn )